Usage Automata
نویسنده
چکیده
Usage automata are an extension of finite stata automata, with some additional features (e.g. parameters and guards) that improve their expressivity. Usage automata are expressive enough to model security requirements of real-world applications; at the same time, they are simple enough to be statically amenable, e.g. they can be model-checked against abstractions of program usages. We study here some foundational aspects of usage automata. In particular, we discuss about their expressive power, and about their effective use in run-time mechanisms for enforcing usage policies.
منابع مشابه
Optimizing Membership Functions using Learning Automata for Fuzzy Association Rule Mining
The Transactions in web data often consist of quantitative data, suggesting that fuzzy set theory can be used to represent such data. The time spent by users on each web page is one type of web data, was regarded as a trapezoidal membership function (TMF) and can be used to evaluate user browsing behavior. The quality of mining fuzzy association rules depends on membership functions and since t...
متن کاملFive Determinisation Algorithms
Determinisation of nondeterministic finite automata is a well-studied problem that plays an important role in compiler theory and system verification. In the latter field, one often encounters automata consisting of millions or even billions of states. On such input, the memory usage of analysis tools becomes the major bottleneck. In this paper we present several determinisation algorithms, all...
متن کاملWeb Recommendation using Semantic Web and Distributed Learning Automata and Graph Partitioning
Recommendation systems aim at directing users toward the resources that best meet their needs and interests. One of the challenging tasks in improving web recommendation algorithms is the simultaneous use of users’s activity log and hyperlink graph of the web site. In this paper, we propose a new recommendation algorithm based on semantic web and web usage data and hyperlink graph of a web site...
متن کاملMultiple Usage of Random Bits in Finite Automata
Finite automata with random bits written on a separate 2way readable tape can recognize languages not recognizable by probabilistic finite automata. This shows that repeated reading of random bits by finite automata can have big advantages over one-time reading of random bits.
متن کاملOptimizing Routign in Wireless Sensor Networks by Labte Energy Aware Protocol Based on Learning Automata
An approach to lengthening lifetime in sensor networks is balancing energy usage in network nodes. This can be done by selecting appropriate paths for sending data and monitoring the amount of passing traffic. In this paper, we propose an energy aware protocol, LABTE, which uses learning automata in order to find appropriate paths for sending data packets to balance energy usage in nodes. Resul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009